The Use of Domination Number of a Random Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association
نویسنده
چکیده
Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the geometry of the proximity regions; and only upper-bounds are available. In this article, we introduce a new type of data-random proximity map and the associated (di)graph in R. We find the asymptotic distribution of the domination number and use it for testing spatial point patterns of segregation and association.
منابع مشابه
Spatial Clustering Tests Based on Domination Number of a New Random Digraph Family
We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points from various classes. We extend the results on the distribution of the domination number of proportional-edge PCDs, and use the domination number as a stati...
متن کاملRelative density of the random r-factor proximity catch digraph for testing spatial patterns of segregation and association
Statistical pattern classification methods based on data-random graphs were introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the data points from various classes. Different random graphs result from different definitions of the proximity region associated with each data point and different graph statistics can be employe...
متن کاملRelative Edge Density of the Underlying Graphs Based on Proportional-Edge Proximity Catch Digraphs for Testing Bivariate Spatial Patterns
The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes. Different random graphs result from different definitions of the proximity region associated with each data point and different graph statistics can be employed for...
متن کاملA new family of random graphs for testing spatial segregation
We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test complete spatial randomness against segregation and association between two or more classes of points. To attain this goal, we use a particular type of para...
متن کاملOn the distribution of the domination number of a new family of parametrized random digraphs
We derive the asymptotic distribution of the domination number of a new family of random digraph called proximity catch digraph (PCD), which has application to statistical testing of spatial point patterns and to pattern recognition. The PCD we use is a parametrized digraph based on two sets of points on the plane, where sample size and locations of the elements of one is held fixed, while the ...
متن کامل